Asynchronous approach in the plane: a deterministic polynomial algorithm
نویسندگان
چکیده
منابع مشابه
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm
In this paper we study the task of approach of two mobile agents having the same limited range of vision and moving asynchronously in the plane. This task consists in getting them in finite time within each other’s range of vision. The agents execute the same deterministic algorithm and are assumed to have a compass showing the cardinal directions as well as a unit measure. On the other hand, t...
متن کاملA Deterministic and Polynomial Modified Perceptron Algorithm
We construct a modi ed perceptron algorithm that is deterministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn log n log(1/ρ)), where m is the number of examples, n the number of dimensions and ρ is approximately the size of the margin. We also construct a non-deterministic modi ed perceptron algorithm running in time O(mn log n log(1/ρ)). 1 A Deter...
متن کاملthe relationship between language and social capital in ilami kurdish: a sociopragmatic approach
چکیده زبان به عنوان یک وسیله در ایجاد و بازسازی سرمایه اجتماعی در چند دهه گذشته مورد توجه بوده است. اگر چه درباره سرمایه اجتماعی و سازه های مربوط به آن زیاد نوشته شده است ولی خیلی کم بر روی اینکه چطور زبان می تواند باعث ایجاد اعتماد یا بی اعتمادی بشود مطالعه ای انجام شده است. این مطالعه به منظور تحقق دو هدف انجام گرفته است. اول تلاش خواهد شد تا یک گونه شناسی از واژگانی که مردم کرد زبان شهر ا...
15 صفحه اولA Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem
We propose a new polynomial-time deterministic algorithm that produces an approximated solution for the traveling salesperson problem. The proposed algorithm ranks cities based on their priorities calculated using a power function of means and standard deviations of their distances from other cities and then connects the cities to their neighbors in the order of their priorities. When connectin...
متن کاملA deterministic algorithm for inverting a polynomial matrix
Improved cost estimates are given for the problem of computing the inverse of an n×n matrix of univariate polynomials over a field. A deterministic algorithm is demonstrated that has worst case complexity (n3s) field operations, where s ≥ 1 is an upper bound for the average column degree of the input matrix. Here, the “+o(1)” in the exponent indicates a missing factor c1(log ns)2 for positive r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2018
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-018-0338-2